Clark's theorem for semi-infinite convex programs
نویسندگان
چکیده
منابع مشابه
A numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملGlobal Optimization Algorithms for Semi-Infinite and Generalized Semi-Infinite Programs
The goals of this thesis are the development of global optimization algorithms for semiinfinite and generalized semi-infinite programs and the application of these algorithms to kinetic model reduction. The outstanding issue with semi-infinite programming (SIP) was a methodology that could provide a certificate of global optimality on finite termination for SIP with nonconvex functions particip...
متن کاملOptimality Conditions for Semi-infinite and Generalized Semi-infinite Programs via lp Exact Penalty Functions
In this paper, we will study optimality conditions of semi-infinite programs and generalized semi-infinite programs, for which the gradient objective function when evaluated at any feasible direction for the linearized constraint set is non-negative. We consider three types of penalty functions for semi-infinite program and investigate the relationship among the exactness of these penalty funct...
متن کاملGlobal solution of semi-infinite programs
A branch-and-bound procedure for the global solution of smooth, nonlinear SIPs has been developed. An upper-bounding problem is constructed using an inclusionconstrained reformulation of the infinite set of constraints, and a convex lowerbounding problem is derived from a discretized approximation of the SIP. Results are provided for a number of problems in the SIP literature.
متن کاملCalmness Modulus of Linear Semi-infinite Programs
Our main goal is to compute or estimate the calmness modulus of the argmin mapping of linear semi-infinite optimization problems under canonical perturbations, i.e., perturbations of the objective function together with continuous perturbations of the right-hand side of the constraint system (with respect to an index ranging in a compact Hausdorff space). Specifically, we provide a lower bound ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 1981
ISSN: 0196-8858
DOI: 10.1016/0196-8858(81)90036-1